An example of design optimization for high evolvability: string rewriting grammar.

نویسنده

  • Hideaki Suzuki
چکیده

As an example of the optimization of an evolutionary system design, a string rewriting system is studied. A set of rewriting rules that defines the growth of a string is experimentarily optimized in terms of maximizing the 'replicative capacity', that is the occurrence ratio of self-replicating strings. It is shown that the most optimized rule set allows many strings to self-replicate by using a special character able to copy an original string sequentially. Then, using various different rewriting rule sets, the connectivity between self-replicating strings is studied. A set of 'hyperblobs' covering the self-replicating strings is extracted and their connectivity is studied. The experimental results show that a large replicative capacity assures strong connectivity between self-replicating genotypes, making the system highly evolvable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimum Shape Design of a Radiant Oven by the Conjugate Gradient Method and a Grid Regularization Approach

This study presents an optimization problem for shape design of a 2-D radiant enclosure with transparent medium and gray-diffuse surfaces. The aim of the design problem is to find the optimum geometry of a radiant enclosure from the knowledge of temperature and heat flux over some parts of boundary surface, namely the design surface. The solution of radiative heat transfer is based on the net r...

متن کامل

From Strings to Trees to Strings to Trees ... (Abstract)

A certain amount of structure is necessary simply because a clause may embed another clause, or one clause may attach to another clause or parts of it. Leaving this need of structure aside, the question then is how much structure should a (minimal) clause have? Grammar formalisms can differ significantly on this issue. Minimal clauses can be just strings, or words linked by dependencies (depend...

متن کامل

String-rewriting grammars for evolutionary architectural design

Evolutionary methods aff ord a productive and creative alternative design workfl ow. Crucial to success is the choice of formal representation of the problem. String-rewriting context-free grammars (CFGs) are one common option in evolutionary computation, but their suitability for design is not obvious. Here, a CFG-based evolutionary algorithm for design is presented. The process of meta-design...

متن کامل

Equational Reasoning with Context-Free Families of String Diagrams

String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bio Systems

دوره 69 2-3  شماره 

صفحات  -

تاریخ انتشار 2003